The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems

Abstract. We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of extensional continuous functionals induced by Kleene’s second model K2. We prove that a formulation of the Riemann Permutation Theorem as well as the statement that all partially Cauchy sequences are Cauchy cannot be realized in this model, while the stateme...

متن کامل

existence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types

بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی ‎‏بیان شد‎‎‏ه اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...

15 صفحه اول

A constructive manifestation of the Kleene-Kreisel continuous functionals

We identify yet another category equivalent to that of Kleene–Kreisel continuous functionals. Reasoning constructively and predicatively, all functions from the Cantor space to the natural numbers are uniformly continuous in this category. We do not need to assume Brouwerian continuity axioms to prove this, but, if we do, then we can show that the full type hierarchy is equivalent to our manife...

متن کامل

Constructive Kripke Semantics and Realizability

What is the truth-value structure of realizability? How can realizability style models be integrated with forcing techniques from Kripke and Beth semantics, and conversely? These questions have received answers in Hyland’s [33], Läuchli’s [43] and in other, related or more syntactic developments cited below. Here we re-open the investigation with the aim of providing more constructive answers t...

متن کامل

Verificationism and classical realizability

This paper investigates the question of whether Krivine’s classical realizability can provide a verificationist interpretation of classical logic. We argue that this kind of realizability can be considered an adequate candidate for this semantic role, provided that the notion of verification involved is no longer based on proofs, but on programs. On this basis, we show that a special reading of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2015

ISSN: 1860-5974

DOI: 10.2168/lmcs-11(1:8)2015